Incremental Development of Deadlock-Free Communicating Systems
نویسنده
چکیده
A basic property which distributed communicating systems have to fulfill is deadlock-freedom. For systems consisting of the parallel composition of subsystems it is complex to check deadlock-freedom because the global state space of the composition has to be investigated. This paper presents an approach by which the absence of deadlocks is preserved during the development. Small initial deadlock-free systems are stepwise extended with new functionalities to large complex systems by transformation rules which preserve deadlock-freedom. Systems are represented by finite automata extended with arbitrary local variables. A verification rule is presented which ensures that the parallel composition of such extended automata is deadlock-free. The advantage of this rule is that only information over pairs of connected subsystems is needed and not over the complete state space.
منابع مشابه
Synthesis of Safe Message-Passing Systems
We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states independently from the contents of channels and the local states of other processes. We present a self-contained, direct, and relatively simple construction based on a new notion called context MSC.
متن کاملNetworks of Preemptible Reactive Processes: An Implementation
Reactive languages such as Esterel, Lustre, Signal , Statecharts etc have found wide use in the development of veriiable software for reactive applications. It has been recently argued that both asynchrony and perfect synchrony are needed for the speciication of complex reactive systems and a paradigm called Communicating Reactive Processes has been proposed for such a uniication. The paradigm ...
متن کاملA Simple Incremental Network Topology for Wormhole Switch-Based Networks
Wormhole switching has become the most widely used switching technique for multicomputers. However, the main drawback of wormhole switching is that blocked messages remain in the network, prohibiting other messages from using the occupied links and buffers. To address the deadlock problem without compromising communication latency and the incremental expansion capability that irregular networks...
متن کاملA Design Strategy for Deadlock-Free Concurrent Systems
When building concurrent systems, it would be useful to have a collection of reusable processes to perform standard tasks. However, without knowing certain details of the inner workings of these components, one can never be sure that they will not cause deadlock when connected to some particular network. Here we describe a hierarchical method for designing complex networks of communicating proc...
متن کاملSafe and Verifiable Design of Multithreaded Java Programs with CSP and FDR
Java may used to develop code for life-, safety-, and mission-critical embedded systems; multithreaded applications must be free from deadlock and livelock. These problems can be eliminated by basing designs on the structures and formalisms of Hoare's Communicating Sequential Processes (CSP). Java class libraries supporting CSP constructs now allow programmers to take advantage of these methods...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997